An Algorithm for Generating a Diverse Set of Multi-Modal Journeys

نویسندگان

چکیده

A direct way of reducing the number cars on road is to dissuade individuals from exclusively using their car and instead integrate public transport into daily routine. Planning multi-modal journeys a complex task for which often rely decision support tools. However, offering different journey options represents significant algorithmic challenge. The failure provide users with set that differ considerably one another in terms modes employed currently preventing widespread uptake planning among general public. In this paper, we introduce dynamic programming algorithm remedies situation by modeling networks as graph then pruned various graph-reduction pre-processing techniques. This approach enables us offer diverse efficient solutions almost instantaneously. computational study three datasets corresponding real-world mobility up 30,000 vertices 596,000 arcs demonstrates effectiveness proposed algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating a Diverse Set of High-Quality Clusterings

We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these partitions to obtain k representatives. The decomposition makes the approach extremely modular and allows us to optimize various criteria that control the choice o...

متن کامل

An Algorithm for Multi-Realization of Nonlinear MIMO Systems

This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...

متن کامل

The IUFP Algorithm for Generating Simulation Heart

In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2022

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a15110416